Linear-Time In-Place DFS and BFS in the Restore Model
نویسندگان
چکیده
We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs in the restore model in linear time. To obtain our results we show several linear-time in-place graph transformations from one representation to another representation.
منابع مشابه
Frameworks for Designing In-place Graph Algorithms
Read-only memory (ROM) model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm that uses O(s) words of extra space requires Ω(n2/s) comparisons for lg n ≤ s ≤ n/ lg n1 and the bound has also been recently matched by an algorithm. However, if we relax the model (from ROM), we do have sortin...
متن کاملFinding Articulation Points of Large Graphs in Linear Time
The complexity analysis of many classical graph algorithms is often based on the assumption of random access to the input data. But as the size of the graph increases, it becomes impossible to maintain the graph in memory, and the cost to just access the graph will dominate the running time. The streaming model was proposed as a practical framework for studying the complexity of large problems,...
متن کاملBFS-Based Model Checking of Linear-Time Properties with an Application on GPUs
Efficient algorithms have been developed to model check liveness properties, such as the well-known Nested Depth-First Search, which uses a depth-first search (DFS) strategy. However, in some settings, DFS is not a suitable option. For instance, when considering distributed model checking on a cluster, or many-core model checking using a Graphics Processing Unit (GPU), Breadth-First Search (BFS...
متن کاملA Note on (Parallel) Depth- and Breadth-First Search by Arc Elimination
This note recapitulates an algorithmic observation for ordered Depth-First Search (DFS) in directed graphs that immediately leads to a parallel algorithm with linear speed-up for a range of processors for non-sparse graphs. The note extends the approach to ordered Breadth-First Search (BFS). With p processors, both DFS and BFS algorithms run in O(m/p + n) time steps on a shared-memory parallel ...
متن کاملApplication of the Weibull Accelerated Failure Time Model in the Determination of Disease-Free Survival Rate of Patients with Breast Cancer
Background and Purpose: The goal of this study is application of the proportional hazards model (PH) and accelerated failure time model (AFT), with consideration Weibull distribution, to determine the level of effectiveness of the factors affecting on the level of disease-free survival (DFS) of the patients with breast cancer. Materials and Methods: Based on the retrospective descriptive stu...
متن کامل